Classical and quantum bounded depth approximation algorithms

Purifying Quantum States: Quantum and Classical Algorithms

vi

Approximation Algorithms and Heuristics for Classical Planning

Automated planning has been an active area of research in theoretical computer science and Artificial Intelligence (AI) for over 40 years. Planning is the study of general purpose algorithms that accept as input an initial state, a set of desired goal states, and a planning domain model that describes how actions can transform the state. The problem is to find a sequence of actions that transfo...

Approximation Algorithms for Bounded Facility Location Problems

The bounded k-median problem is to select in an undirected graph G = (V, E) a set S of k vertices such that the distance from any vertex v ∈ V to S is at most a given bound d and the average distance from vertices V\S to S is minimized. We present randomized algorithms for several versions of this problem and we prove some inapproximability results. We also study the bounded version of the unca...

Approximation Algorithms for Bounded Dimensional Metric Spaces

The study of finite metrics is an important area of research, because of its wide applications to many different problems. The input of many problems (for instance clustering, near-neighbor queries and network routing) naturally involves a set of points on which a distance function has been defined. Hence, one would be motivated to store and process metrics in an efficient manner. The central i...

Isomorphism and Factorization- Classical and Quantum Algorithms